Generalized Kinkelin's formulas

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On generalized averaged Gaussian formulas

We present a simple numerical method for constructing the optimal (generalized) averaged Gaussian quadrature formulas which are the optimal stratified extensions of Gauss quadrature formulas. These extensions exist in many cases in which real positive Kronrod formulas do not exist. For the Jacobi weight functions w(x) ≡ w(α,β)(x) = (1− x)α(1 + x)β (α, β > −1) we give a necessary and sufficient ...

متن کامل

Minimization for Generalized Boolean Formulas

The minimization problem for propositional formulas is an important optimization problem in the second level of the polynomial hierarchy. In general, the problem is Σp2-complete under Turing reductions, but restricted versions are tractable. We study the complexity of minimization for formulas in two established frameworks for restricted propositional logic: The Post framework allowing arbitrar...

متن کامل

On Generalized Sethi-vafa-witten Formulas

We present a formula for computing proper pushforwards of classes in the Chow ring of a projective bundle under the projection π : P(E )→ B, for B a non-singular compact complex algebraic variety of any dimension. Our formula readily produces generalizations of formulas derived by Sethi,Vafa, and Witten to compute the Euler characteristic of elliptically fibered Calabi-Yau fourfolds used for F-...

متن کامل

Some Asymptotic Formulas on Generalized Divisor Functions

1 . Throughout this paper, we use the following notation : c•1 , c2 , . . ., X0 , X1 , . . . denote positive absolute constants. We denote the number of elements of the finite set S by BSI . We write ex =exp (x) . We denote the least prime factor of n by p(n) . We write pall n if pain but pa+1 f n . v(n) denotes the number of the distinct prime factors of n, while the number of all the prime fa...

متن کامل

Stable Models of Formulas with Generalized Quantifiers

Applications of answer set programming motivated various extensions of the stable model semantics, for instance, to incorporate aggregates and abstract constraint atoms, to facilitate interface with external information sources, such as ontology descriptions, and to integrate with other computing paradigms, such as constraint solving. This paper provides a uniform view on some of these extensio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Kodai Mathematical Journal

سال: 2007

ISSN: 0386-5991

DOI: 10.2996/kmj/1183475511